Empowering Communications in Vehicular Networkswith an Intelligent Blockchain-Based Solution

Blockchains have emerged over time as a reliable and secure way to record transactions in an immutable manner in a wide range of application domains. However, current related solutions are not yet capable of appropriately checking the authenticity of data when their volumes are huge. They are not also capable of updating Blockchain data blocks and synchronizing them within reasonable timeframes. This is the case within the specific context of Blockchain vehicular networks, where these solutions are commonly cumbersome when attempting to add new vehicles to the network. In order to address these problems, we propose in this paper a new Blockchain-based solution that intelligently implement selective communication and collaborative endorsement approaches to reduce communications between vehicles. Our solution represents the vehicles of the Blockchain as intelligent software agents with a Belief-Desire-Intention (BDI) architecture. Furthermore, we propose an approach based on multi-endorsement levels to exchange data of varying sensitive categories. This approach, which is based on endorsing scores, is also used to shorten the admission of new vehicles into the Blockchain. We run simulations using the Hyperledger Fabric Blockchain tool. Results show the efficiency of our solution in reducing the processing times of transactions within two different scenarios

A Neural network approach to visibility range estimation under foggy weather conditions

© 2017 The Authors. Published by Elsevier B.V. The degradation of visibility due to foggy weather conditions is a common trigger for road accidents and, as a result, there has been a growing interest to develop intelligent fog detection and visibility range estimation systems. In this contribution, we provide a brief overview of the state-of-the-art contributions in relation to estimating visibility distance under foggy weather conditions. We then present a neural network approach for estimating visibility distances using a camera that can be fixed to a roadside unit (RSU) or mounted onboard a moving vehicle. We evaluate the proposed solution using a diverse set of images under various fog density scenarios. Our approach shows very promising results that outperform the classical method of estimating the maximum distance at which a selected target can be seen. The originality of the approach stems from the usage of a single camera and a neural network learning phase based on a hybrid global feature descriptor. The proposed method can be applied to support next-generation cooperative hazard & incident warning systems based on I2V, I2I and V2V communications. Peer-review under responsibility of the Conference Program Chairs

Evaluating active traffc management (ATM) strategies under non-recurring congestion: Simulation-based with benefit cost analysis case study

© 2020 by the authors. Dynamic hard shoulder running and ramp closure are two active traffic management (ATM) strategies that are used to alleviate highway traffic congestion. This study aims to evaluate the effects of these two strategies on congested freeways under non-recurring congestion. The study\u27s efforts can be considered in two parts. First, we performed a detailed microsimulation analysis to quantify the potential benefits of these two ATM strategies in terms of safety, traffic operation, and environmental impact. Second, we evaluated the implementation feasibility of these two strategies. The simulation results indicated that the implementation of the hard shoulder showed a 50%-57% reduction in delay, a 41%-44% reduction in fuel consumption and emissions, and a 15%-18% increase in bottleneck throughput. By contrast, the implementation of ramp closure showed a 20%-34% decrease in travel time, a 6%-9% increase in bottleneck throughput, and an 18%-32% reduction in fuel consumption and emissions. Eventually, both strategies were found to be economically feasible

Estimating ambient visibility in the presence of fog: a deep convolutional neural network approach

© 2019, Springer-Verlag London Ltd., part of Springer Nature. Next-generation intelligent transportation systems are based on the acquisition of ambient data that influence traffic flow and safety. Among these, is the ambient visibility range whose estimation, in the presence of fog, is extremely useful for next-generation intelligent transportation systems. However, existing camera-based approaches are based on “engineered features” extraction methods that use computer algorithms and procedures from the image processing field. In this contribution, a novel approach to estimate visibility range under foggy weather conditions is proposed which is based on “learned features” instead. More precisely, we use AlexNet deep convolutional neural network (DCNN), trained with raw image data, for feature extraction and a support vector machine (SVM) for visibility range estimation. Our quantitative analysis showed that the proposed approach is very promising in estimating the visibility range with very good accuracy. The proposed solution can pave the way towards intelligent driveway assistance systems to enhance awareness of driving weather conditions and hence mitigate the safety risks emanating from fog-induced low visibility conditions

Estimating meteorological visibility range under foggy weather conditions: A deep learning approach

© 2018 The Authors. Published by Elsevier Ltd. Systems capable of estimating visibility distances under foggy weather conditions are extremely useful for next-generation cooperative situational awareness and collision avoidance systems. In this paper, we present a brief review of noticeable approaches for determining visibility distance under foggy weather conditions. We then propose a novel approach based on the combination of a deep learning method for feature extraction and an SVM classifier. We present a quantitative evaluation of the proposed solution and show that our approach provides better performance results compared to an earlier approach that was based on the combination of an ANN model and a set of global feature descriptors. Our experimental results show that the proposed solution presents very promising results in support for next-generation situational awareness and cooperative collision avoidance systems. Hence it can potentially contribute towards safer driving conditions in the presence of fog

Estimating Scalability Issues While Finding an Optimal Assignment for Carpooling

AbstractAn automatic service to match commuting trips has been designed. Candidate carpoolers register their personal profile and a set of periodically recurring trips. The Global CarPooling Matching Service (GCPMS) shall advise registered candidates on how to combine their commuting trips by carpooling. Planned periodic trips correspond to nodes in a graph; the edges are labeled with the probability for negotiation success while trying to merge planned trips by carpooling. The probability values are calculated by a learning mechanism using on one hand the registered person and trip characteristics and on the other hand the negotiation feedback. The GCPMS provides advice by maximizing the expected value for negotiation success. This paper describes possible ways to determine the optimal advice and estimates computational scalability using real data for Flanders

Analysis of the Co-routing Problem in Agent-based Carpooling Simulation

AbstractCarpooling can cut costs and help to solve congestion problems but does not seem to be popular. Behavioral models allow to study the incentives and inhibitors for carpooling and the aggregated effect on the transportation system. In activity based modeling used for travel forecasting, cooperation between actors is important both for schedule planning and revision. Carpooling requires cooperation while commuting which in turn involves co-scheduling and co-routing. The latter requires combinatorial optimization. Agent-based systems used for activity based modeling, contain large amounts of agents. The agent model requires helper algorithms that deliver high quality solutions to embedded optimisation problems using a small amount of resources. Those algorithms are invoked thousands of times during agent society evolution and schedule execution simulation. Solution quality shall be sufficient in order to guarantee realistic agent behavior. This paper focuses on the co-routing problem

Agent-based Simulation Model for Long-term Carpooling: Effect of Activity Planning Constraints

AbstractIn order to commute by carpooling, individuals need to communicate, negotiate and coordinate, and in most cases adapt their daily schedule to enable cooperation. Through negotiation, agents (individuals) can reach complex agreements in an iterative way, which meets the criteria for the successful negotiation. The procedure of negotiation and trip execution in the long-term carpooling consists of a number of steps namely; (i) decision to carpool, (ii) exploration and communication, (iii) negotiation, (iv) coordination and schedule adaptation, (v) long term trip execution (carpooling), (vi) negotiation during carpooling and (vii) carpool termination and exploration for new carpool. This paper presents a conceptual design of an agent-based model (ABM) of a set of candidate carpoolers. A proof of concept implementation is presented. The proposed model is used for simulating the interactions between autonomous agents. The model enables communication to trigger the negotiation process; it measures the effect of pick-drop and shopping activities on the carpooling trips. Carpooling for commuting is simulated: we consider a set of two intermediate trips (home-to-work and work-to-home) for the long-term carpooling. Schedule adaptation during negotiation depends on personal preferences. Trip timing and duration are crucial factors. We carried out a validation study of our results with real data (partial) collected in Flanders, Belgium. Simulation results show the effect of constraining activities on the carpooling trips. The future research will mainly focus on enhancing the mechanisms for communication and negotiation between agents

Towards Delay-sensitive Routing in Underwater Wireless Sensor Networks

AbstractIn Underwater Acoustic Sensor Networks (UASNs), fundamental difference between operational methodologies of routing schemes arises due to the requirement of time-critical applications therefore, there is a need for the design of delay-sensitive techniques. In this paper, Delay-Sensitive Depth-Based Routing (DSDBR), Delay-Sensitive Energy Efficient Depth-Based Routing (DSEEDBR) and Delay-Sensitive Adaptive Mobility of Courier nodes in Threshold-optimized Depth-based routing (DSAMCTD) protocols are proposed to empower the depth-based routing schemes. The proposed approaches formulate delay-efficient Priority Factors (PF) and Delay-Sensitive Holding time (DS HT) to minimize end-to-end delay with a small decrease in network throughput. These schemes also employ an optimal weight function WF for the computation of transmission loss and speed of received signal. Furthermore, solution for delay lies in efficient data forwarding, minimal relative transmissions in low-depth region and better forwarder selection. Simulations are performed to assess the proposed protocols and the results indicate that the three schemes largely minimize end-to-end delay of network